Circumference of essentially 4-connected planar triangulations
نویسندگان
چکیده
منابع مشابه
A bijection for essentially 4-connected toroidal triangulations
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications (drawing algorithm, random generation, enumeration. . . ). In this paper we introduce and study a generalization of these objects for the toroidal case. Contrary to...
متن کاملLonger Cycles in Essentially 4-Connected Planar Graphs
A planar 3-connected graph G is called essentially 4-connected if, for every 3-separator S, at least one of the two components of G−S is an isolated vertex. Jackson and Wormald proved that the length circ(G) of a longest cycle of any essentially 4-connected planar graph G on n vertices is at least 2n+4 5 and Fabrici, Harant and Jendrol’ improved this result to circ(G) ≥ 1 2 (n+ 4). In the prese...
متن کاملOn Longest Cycles in Essentially 4-connected Planar Graphs
A planar 3-connected graph G is essentially 4-connected if for any 3-separator S of G, one component of the graph obtained from G by removing S is a single vertex. B. Jackson and N.C. Wormald proved that an essentially 4-connected planar graph on n vertices contains a cycle C such that |V (C)| ≥ 2n+4 5 . For a cubic essentially 4-connected planar graph G, B. Grünbaum, J. Malkevitch , and C.-Q. ...
متن کاملThe (3, 1)-ordering for 4-connected planar triangulations
Canonical orderings of planar graphs have frequently been used in graph drawing and other graph algorithms. In this paper we introduce the notion of an (r, s)-canonical order, which unifies many of the existing variants of canonical orderings. We then show that (3, 1)-canonical ordering for 4-connected triangulations always exist; to our knowledge this variant of canonical ordering was not prev...
متن کاملFour-connected triangulations of planar point sets
In this paper, we consider the problem of determining in polynomial time whether a given planar point set P of n points admits 4-connected triangulation. We propose a necessary and sufficient condition for recognizing P , and present an O(n) algorithm of constructing a 4-connected triangulation of P . Thus, our algorithm solves a longstanding open problem in computational geometry and geometric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2021
ISSN: 1526-1719
DOI: 10.7155/jgaa.00552